TSTP Solution File: DAT144^1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : DAT144^1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 30 22:12:22 EDT 2023
% Result : Theorem 4.24s 4.41s
% Output : Proof 4.24s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : DAT144^1 : TPTP v8.1.2. Released v7.0.0.
% 0.11/0.14 % Command : duper %s
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 24 15:11:02 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.24/4.41 SZS status Theorem for theBenchmark.p
% 4.24/4.41 SZS output start Proof for theBenchmark.p
% 4.24/4.41 Clause #0 (by assumption #[]): Eq (∀ (A : Type) (P : A → Prop) (Q : A → A → Prop) (X : A), Eq (bNF_eq_onp A P) Q → Eq (P X) (Q X X)) True
% 4.24/4.41 Clause #302 (by assumption #[]): Eq (p x) True
% 4.24/4.41 Clause #303 (by assumption #[]): Eq (Not (bNF_eq_onp a p x x)) True
% 4.24/4.41 Clause #304 (by clausification #[0]): ∀ (a : Type), Eq (∀ (P : a → Prop) (Q : a → a → Prop) (X : a), Eq (bNF_eq_onp a P) Q → Eq (P X) (Q X X)) True
% 4.24/4.41 Clause #305 (by clausification #[304]): ∀ (a : Type) (a_1 : a → Prop), Eq (∀ (Q : a → a → Prop) (X : a), Eq (bNF_eq_onp a a_1) Q → Eq (a_1 X) (Q X X)) True
% 4.24/4.41 Clause #306 (by clausification #[305]): ∀ (a : Type) (a_1 : a → Prop) (a_2 : a → a → Prop),
% 4.24/4.41 Eq (∀ (X : a), Eq (bNF_eq_onp a a_1) a_2 → Eq (a_1 X) (a_2 X X)) True
% 4.24/4.41 Clause #307 (by clausification #[306]): ∀ (a : Type) (a_1 : a → Prop) (a_2 : a → a → Prop) (a_3 : a),
% 4.24/4.41 Eq (Eq (bNF_eq_onp a a_1) a_2 → Eq (a_1 a_3) (a_2 a_3 a_3)) True
% 4.24/4.41 Clause #308 (by clausification #[307]): ∀ (a : Type) (a_1 : a → Prop) (a_2 : a → a → Prop) (a_3 : a),
% 4.24/4.41 Or (Eq (Eq (bNF_eq_onp a a_1) a_2) False) (Eq (Eq (a_1 a_3) (a_2 a_3 a_3)) True)
% 4.24/4.41 Clause #309 (by clausification #[308]): ∀ (a : Type) (a_1 : a → Prop) (a_2 : a) (a_3 : a → a → Prop),
% 4.24/4.41 Or (Eq (Eq (a_1 a_2) (a_3 a_2 a_2)) True) (Ne (bNF_eq_onp a a_1) a_3)
% 4.24/4.41 Clause #310 (by clausification #[309]): ∀ (a : Type) (a_1 : a → Prop) (a_2 : a → a → Prop) (a_3 : a),
% 4.24/4.41 Or (Ne (bNF_eq_onp a a_1) a_2) (Eq (a_1 a_3) (a_2 a_3 a_3))
% 4.24/4.41 Clause #311 (by destructive equality resolution #[310]): ∀ (a : Type) (a_1 : a → Prop) (a_2 : a), Eq (a_1 a_2) (bNF_eq_onp a a_1 a_2 a_2)
% 4.24/4.41 Clause #732 (by clausification #[303]): Eq (bNF_eq_onp a p x x) False
% 4.24/4.41 Clause #733 (by superposition #[732, 311]): Eq (p x) False
% 4.24/4.41 Clause #734 (by superposition #[733, 302]): Eq False True
% 4.24/4.41 Clause #735 (by clausification #[734]): False
% 4.24/4.41 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------